Finite-Valued Lukasiewicz Modal Logic Is PSPACE-Complete
نویسندگان
چکیده
It is well-known that satisfiability (and hence validity) in the minimal classical modal logic is a PSPACE-complete problem. In this paper we consider the satisfiability and validity problems (here they are not dual, although mutually reducible) for the minimal modal logic over a finite Lukasiewicz chain, and show that they also are PSPACE-complete. This result is also true when adding either the Delta operator or truth constants in the language, i.e. in all these cases it is PSPACEcomplete.
منابع مشابه
The complexity of admissible rules of Lukasiewicz logic
We investigate the computational complexity of admissibility of inference rules in infinite-valued Lukasiewicz propositional logic ( L). It was shown in [13] that admissibility in L is checkable in PSPACE. We establish that this result is optimal, i.e., admissible rules of L are PSPACE-complete. In contrast, derivable rules of L are known to be coNP-complete.
متن کاملA Hennessy-Milner Property for Many-Valued Modal Logics
A Hennessy-Milner property, relating modal equivalence and bisimulations, is defined for many-valued modal logics that combine a local semantics based on a complete MTL-chain (a linearly ordered commutative integral residuated lattice) with crisp Kripke frames. A necessary and sufficient algebraic condition is then provided for the class of image-finite models of these logics to admit the Henne...
متن کاملAdmissible Rules of Lukasiewicz Logic
We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity of universal sentences in free MV -algebras, is decidable (in PSPACE ).
متن کاملInterpolation and Three-valued Logics
We consider propositional logic. Three-valued logics are old: the first one is Lukasiewicz three valued logic from 1920 [8]. Gödel in [5] from 1932 studied a hierarchy of finite-valued logics, containing Gödel three-valued logic. Our main interest pays to Kleene three-valued logic [6]. Other threevalued logics will not be considered here. Let us agree that the three truth values are 0, 1 2 , 1 ...
متن کاملResiduated Basic Logic II. Interpolation, Decidability and Embedding
We prove that the sequent calculus LRBL for residuated basic logic RBL has strong finite model property, and that intuitionistic logic can be embedded into basic propositional logic BPL. Thus RBL is decidable. Moreover, it follows that the class of residuated basic algebras has the finite embeddability property, and that BPL is PSPACE-complete, and that intuitionistic logic can be embedded into...
متن کامل